Distance magic circulant graphs

نویسندگان

  • Sylwia Cichacz-Przenioslo
  • Dalibor Froncek
چکیده

Let G = (V,E) be a graph of order n. A distance magic labeling of G is a bijection l : V → {1, 2, . . . , n} for which there exists a positive integer k such that ∑ x∈N(v) l(x) = k for all v ∈ V , where N(v) is the open neighborhood of v. In this paper we deal with circulant graphs C(1, p). The circulant graph Cn(1, p) is the graph on the vertex set V = {x0, x1, . . . , xn−1} with edges (xi, xi+p) for i = 0, . . . , n−1 where i + p is taken modulo n. We completely characterize distance magic graphs Cn(1, p) for p odd. We also give some sufficient conditions for p even. Moreover, we also consider a group distance magic labeling of Cn(1, p).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectra of graphs and closed distance magic labelings

Let G = (V,E) be a graph of order n. A closed distance magic labeling of G is a bijection l : V (G) → {1, . . . , n} for which there exists a positive integer k such that ∑ x∈N [v] l(x) = k for all v ∈ V , where N [v] is the closed neighborhood of v. We consider the closed distance magic graphs in the algebraic context. In particular we analyze the relations between the closed distance magic la...

متن کامل

Distance spectra and Distance energy of Integral Circulant Graphs

The distance energy of a graph G is a recently developed energy-type invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix of G. There was a vast research for the pairs and families of non-cospectral graphs having equal distance energy, and most of these constructions were based on the join of graphs. A graph is called circulant if it is Cayley graph on the ...

متن کامل

Bounds for minimum feedback vertex sets in distance graphs and circulant graphs

For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i− j| ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number of vertices to be removed in order to cut all cycles in the graph. This paper studies the minimum feedba...

متن کامل

Finite prime distance graphs and 2-odd graphs

A graph G is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is prime (either 2 or odd). We prove that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch windmill graphs and paper mill graphs are prime distance graphs if and only if the Tw...

متن کامل

Connectivity and diameter in distance graphs

For n ∈ N and D ⊆ N, the distance graph P n has vertex set {0, 1, . . . , n− 1} and edge set {ij | 0 ≤ i, j ≤ n − 1, |j − i| ∈ D}. The class of distance graphs generalizes the important and very well-studied class of circulant graphs which have been proposed for numerous network applications. In view of fault tolerance and delay issues in these applications, the connectivity and diameter of cir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 339  شماره 

صفحات  -

تاریخ انتشار 2016